Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
نویسندگان
چکیده
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemptive fixed priority scheduler. Recently developed techniques, based on the analysis of tasks with dynamic offsets, take into account the precedence relations between tasks only indirectly, through terms iteratively estimated from the response times of the tasks. With the techniques presented in this paper, we exploit the precedence relations in a more accurate way, and we also take advantage of the priority structure of the different tasks. These considerations permit a significant improvement of the results of the analysis applied to distributed and multiprocessor systems.
منابع مشابه
Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems
This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have fixed priorities and hard end-to-end deadlines that are equal to or less than the respective period. We develop a method to transform arbitrary precedence relations int...
متن کاملImproved Schedulability Analysis of Real-Time Sporadic Tasks with EDF Preemptive Scheduling
This paper proposes an analysis method to check the schedulability of a set of sporadic tasks under earliest deadline first (EDF) scheduler. The sporadic task model consists of subtasks with precedence constraints, arbitrary arrival times and deadlines. In order to determine the schedulability, we present an approach to find exact worst case response time (WCRT) of subtatsks. With the technique...
متن کاملHolistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task is statically allocated to a processor, and tasks allocated on the same processor are handled by a single-processor scheduling algorithm. Precedence constraints among tasks of the same transaction are modeled by proper...
متن کاملEfficient Feasibility Analysis of Real-Time Asynchronous Task Sets
Several schedulability tests for real-time periodic task sets scheduled under the Earliest Deadline First algorithm have been proposed in literature, including analyses for precedence and resource constraints. However, all available tests consider synchronous task sets only, that are task sets in which all tasks are initially activated at the same time. In fact, every necessary and sufficient f...
متن کاملSchedulability Checking in Real-time Systems Using Neural Networks
In distributed Hard-Real-Time systems the correctness of a computation strictly depends on the results and on the computing time to produce them. We introduce a mathematical model to check the schedulabil-ity of a set of parallel programs represented through Data Flow precedence graphs. Schedulability checking involves a mapping subproblem, which is NP-complete. We transform the schedulability ...
متن کامل